Recursive Schur Decomposition
نویسندگان
چکیده
In this article, we present a parallel recursive algorithm based on multi-level domain decomposition that can be used as a precondtioner to a Krylov subspace method to solve sparse linear systems of equations arising from the discretization of partial differential equations (PDEs). We tested the effectiveness of the algorithm on several PDEs using different number of sub-domains (ranging from 8 to 32768) and various problem sizes (ranging from about 2000 to over a billion degrees of freedom). We report the results from these tests; the results show that the algorithm scales very well with the number of sub-domains.
منابع مشابه
Look-ahead Levinson- and Schur-type Recurrences in the Padé Table∗
For computing Padé approximants, we present presumably stable recursive algorithms that follow two adjacent rows of the Padé table and generalize the well-known classical Levinson and Schur recurrences to the case of a nonnormal Padé table. Singular blocks in the table are crossed by look-ahead steps. Ill-conditioned Padé approximants are skipped also. If the size of these lookahead steps is bo...
متن کاملPowers of the Vandermonde determinant, Schur functions, and the dimension game
Since every even power of the Vandermonde determinant is a symmetric polynomial, we want to understand its decomposition in terms of the basis of Schur functions. We investigate several combinatorial properties of the coefficients in the decomposition. In particular, I will give a recursive approach for computing the coefficient of the Schur function sμ in the decomposition of an even power of ...
متن کاملTheoretical and numerical aspects of an SVD-based method for band-limiting finite-extent sequences
4 square-root Schur RLS adaptive filter with two-fold (inputand residual) normalization is presented. The algorithm has severalattractive features suchas a fully systolic structure based on elementaryhyperbolic plane rotations. All internal variables are bounded in theunit interval and fully utilize it in successive stages due to an inherent‘‘ autoscaling ” property of t...
متن کاملA Recursive Blocked Schur Algorithm for Computing the Matrix Square Root
The Schur method for computing a matrix square root reduces the matrix to the Schur triangular form and then computes a square root of the triangular matrix. We show that by using a recursive blocking technique the computation of the square root of the triangular matrix can be made rich in matrix multiplication. Numerical experiments making appropriate use of level 3 BLAS show significant speed...
متن کاملImage Watermarking by SCHUR Decomposition
To rely on authenticity of Image we can use Image Watermarking. In this Paper a new robust Image watermarking algorithm is proposed, which is based on Schur decomposition. Schur decomposition gives good result in terms of performance, robustness, imperceptibility and speed etc Schur decomposition technique shows a good performance against the various attacks such as JPEG compression, cropping, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1210.6266 شماره
صفحات -
تاریخ انتشار 2012